Transformation of bases for relative linear sets
نویسندگان
چکیده
منابع مشابه
Linear Algebra Methods for the Transformation of Grr Obner Bases Linear Algebra Methods for the Transformation of Grr Obner Bases
A solution to the problem of converting a Grr obner basis between different orderings for a given ideal is known for the zero-dimensional case. We show how to solve this problem for one-dimensional ideals in two variables by using the same linear algebra techniques that are exploited in the existing algorithm. For ideals in more than two variables we describe two other known approaches that als...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملRelative Sets and Rough Sets
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap’s four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap’s logic. Like truth-values of Belnap’s logic, relative sets have two orderings; one is an order of inclu...
متن کاملAccuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery
Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...
متن کاملGraver Bases and Universal Gröbner Bases for Linear Codes
Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1938
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1938-06848-6